Index Modulation–Aided Mixed Massive Random Access

نویسندگان

چکیده

In this study, a mixed massive random access scheme is considered where part of users transmit both common information and user-specific information, while others only information. scheme, transmitted by index modulation (IM)–aided unsourced (URA), IM-aided sourced (SRA). Practically, URA partitions channel blocks one transmission frame into multiple groups then employs the IM principle to activate in each group. SRA allocates pilot sequences user activates sequence whose carries data At receiver, covariance-based maximum likelihood detection (CB-MLD) employed recover active compressed sensing (CS) code words jointly. To stitch at different URA, modified tree decoder proposed take constraint account. Furthermore, relax strict threshold requirement improve performance, an iterative CS detector are decode successive signal reconstruction interference cancellation utilized. Finally, computer simulations given demonstrate performance scheme.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rate-storage regions for Massive Random Access

This paper introduces a new source coding paradigm called Sequential Massive Random Access (SMRA). In SMRA, a set of correlated sources is encoded once for all and stored on a server, and clients want to successively access to only a subset of the sources. Since the number of simultaneous clients can be huge, the server is only allowed to extract a bitstream from the stored data: no re-encoding...

متن کامل

Sparse Combinatorial Group Testing for Low-Energy Massive Random Access

We present random access schemes for machine-type communication where a massive number of low-energy wireless devices want to occasionally transmit short information packets. We focus on the device discovery problem, with extensions to joint discovery and data transmission as well as data transmission without communicating device identities. We formulate this problem as a combinatorial group te...

متن کامل

Coded Pilot Access: A Random Access Solution for Massive MIMO Systems

We present a novel access protocol for crowd scenarios in massive MIMO (Multiple-input multiple-output) systems. Crowd scenarios are characterized by a large number of users with intermittent access behavior, whereby orthogonal scheduling is infeasible. In such scenarios, random access is a natural choice. The proposed access protocol relies on two essential properties of a massive MIMO system,...

متن کامل

D2D-Based Grouped Random Access to Mitigate Radio Access Network Congestion in Massive Machine-Type Communications

Massive Machine-Type Communications (mMTC) presents significant challenges in terms of the number of devices accessing the shared resource, and coordination among those devices. This paper overviews work on RAN congestion control in order to better manage resources in the context of device-to-device (D2D) interaction among the MTCDs. It then proceeds to introduce a novel grouping-assisted rando...

متن کامل

On LDPC Code Based Massive Random-Access Scheme for the Gaussian Multiple Access Channel

This paper deals with the problem of massive random access for Gaussian multiple access channel (MAC). We continue to investigate the coding scheme for Gaussian MAC proposed by A. Vem et al in 2017. The proposed scheme consists of four parts: (i) the data transmission is partitioned into time slots; (ii) the data, transmitted in each slot, is split into two parts, the first one set an interleav...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Frontiers in communications and networks

سال: 2021

ISSN: ['2673-530X']

DOI: https://doi.org/10.3389/frcmn.2021.694557